/*
 * Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume no duplicates in the array.

Here are few examples.
[1,3,5,6], 5 > 2
[1,3,5,6], 2 > 1
[1,3,5,6], 7 > 4
[1,3,5,6], 0 > 0
 */
package com.xinpan.exercise;

public class SearchInsertPosition {
    public int searchInsert(int[] A, int target) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if(A.length == 0)
            return 0;
        int s = 0;
        int e = A.length-1;
        int m = 0;
        int p = e;
        
        while(s <= e)
        {
            m = (s+e)/2;
            if(A[m] > target)
            {
                e = m-1;
                p = e;
            }
            else if(A[m] < target)
            {
                s = m+1;
            }
            else
                return m;
        } 
        
        if(p < 0)
            return 0;
        else if(A[p] < target)
            return p+1;
        
        return p;
    }
}
